Abstract Modular Inference Systems and Solvers
نویسندگان
چکیده
Modular Inference Systems and Solvers Yuliya Lierler University of Nebraska at Omaha, [email protected] Miroslaw Truszczyński University of Kentucky Follow this and additional works at: http://digitalcommons.unomaha.edu/compsicfacproc Part of the Computer Sciences Commons This Conference Proceeding is brought to you for free and open access by the Department of Computer Science at DigitalCommons@UNO. It has been accepted for inclusion in Computer Science Faculty Proceedings & Presentations by an authorized administrator of DigitalCommons@UNO. For more information, please contact [email protected]. Recommended Citation Lierler, Yuliya and Truszczyński, Miroslaw, "Abstract Modular Inference Systems and Solvers" (2014). Computer Science Faculty Proceedings & Presentations. Paper 30. http://digitalcommons.unomaha.edu/compsicfacproc/30 Abstract Modular Inference Systems and SolversModular Inference Systems and Solvers Yuliya Lierler and Miroslaw Truszczynski 1 University of Nebraska at Omaha [email protected] 2 University of Kentucky
منابع مشابه
Abstract Modular Systems and Solvers
Modular Systems and Solvers Yuliya Lierler and Miroslaw Truszczynski 1 University of Nebraska at Omaha [email protected] 2 University of Kentucky
متن کاملThree Semantics for Modular Systems
In this paper, we further develop the framework of Modular Systems that lays model-theoretic foundations for combining different declarative languages, agents and solvers. We introduce a multi-language logic of modular systems. We define two novel semantics, a structural operational semantics, and an inference-based semantics. We prove the new semantics are equivalent to the original model-theo...
متن کاملThe Architecture of Inference from SMT to ETB
Modularity plays a central role in logical reasoning. We want to be able to reuse proofs, proof patterns, theories, and specialized reasoning procedures. Architectures that support modularity have been developed at all levels of inference: SAT solvers, theory solvers, combination solvers and rewriters, SMT solvers, simplifiers, rewriters, and tacticsbased interactive theorem provers. Prior work...
متن کاملA Modular Approach to Proving Confluence
We are interested in investigating the confluence properties of cooperating constraint solvers. To this end, we model solvers as reductions that transform constraint networks, we define the notion of insensitivity to a superset relation, and show that, if each solver of a given set of solvers is insensitive to the same terminating superset relation, then any combination of these solvers is conf...
متن کامل